Infinite Set Unification with Application to Categorial Grammar

Categorial Unification Grammars

Categorial unification grammars (CUGs) embody the essential properties of both unification and categorial grammar formalisms. Their efficient and uniform way of encoding linguistic knowledge in well-understood and widely used representations makes them attractive for computational applications and for linguistic research. In this paper, the basic concepts of CUGs and simple examples of their ap...

On the computation of joins for non associative Lambek categorial grammars

This paper deals with an application of unification and rewriting to Lambek categorial grammars used in the field of computational linguistics. Unification plays a crucial role in the acquisition of categorial grammar acquisition, as in [Kan98] ; a modified unification has been proposed [For01a] in this context for Lambek categorial grammars, to give an account of their logical part. This modif...

Learning to Map Chinese Sentences to Logical Forms

This paper addresses the problem of learning to map Chinese sentences to logical forms. The training data consist of Chinese natural language sentences paired with logical representations of their meaning. Although many approaches have been developed for learning to map from some western natural languages to two different meaning representations, there is no such approached for Chinese language...

Focus and Phrasing in Unification Categorial Grammar

Conjoinability and unification in Lambek categorial grammars

Recently, learning algorithms in Gold’s model have been proposed for some particular classes of classical categorial grammars [Kan98]. We are interested here in learning Lambek categorial grammars. In general grammatical inference uses unification and substitution. In the context of Lambek categorial grammars it seems appropriate to incorporate an operation on types based both on deduction (Lam...